On Müntz Theorem for countable compact sets
نویسندگان
چکیده
منابع مشابه
Countable Sets and Hessenberg’s Theorem
The papers [20], [16], [3], [11], [9], [15], [5], [8], [7], [21], [19], [2], [1], [10], [22], [12], [13], [18], [14], [17], [4], and [6] provide the terminology and notation for this paper. For simplicity we follow the rules: X, Y are sets, D is a non-empty set, m, n, n1, n2, n3, m2, m1 are natural numbers, A, B are ordinal numbers, L, K, M , N are cardinal numbers, x is arbitrary, and f is a f...
متن کاملD-sets and a Sárközy Theorem for Countable Fields
We establish that if F is a countable field of characteristic p, U is a unitary action of F` on a Hilbert space H , and P is an essential idempotent ultrafilter on F then for every polynomial r : F → F` with r(0) = 0 one has P-limg Ur(g)f = Prf weakly, where Pr is the projection onto the closed subspace Kr = { f ∈ H : {Ur(g)f}g∈F is precompact in the strong topology } . We then derive combinato...
متن کاملOn the countable generator theorem
Let T be a finite entropy, aperiodic automorphism of a nonatomic probability space. We give an elementary proof of the existence of a finite entropy, countable generating partition for T . In this short article we give a simple proof of Rokhlin’s countable generator theorem [Ro], originating from considerations in [Se] which use standard techniques in ergodic theory. We hope that these consider...
متن کاملOn nowhere first-countable compact spaces with countable π-weight
The minimum weight of a nowhere first-countable compact space of countable π-weight is shown to be κB, the least cardinal κ for which the real line R can be covered by κ many nowhere dense sets.
متن کاملMenger's theorem for countable graphs
For a finite graph G= (I’, E) Menger’s Theorem [6] states the following: if A, B c V then the minimal size of an A -B separating set of vertices (i.e., a set whose removal disconnects A from B), equals the maximal size of a set of disjoint A -B paths. This version of the theorem remains true, and quite easy to prove, also in the infinite case. To see this, take 9 to be a maximal (with respect t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2006
ISSN: 1370-1444
DOI: 10.36045/bbms/1148059333